Theory-Contraction is NP-Complete
نویسنده
چکیده
I investigate the problem of contracting a dependency-network with respect to any of its nodes. The resulting contraction must not contain the node in question, but must also be a minimal mutilation of the original network. Identifying successful and minimally mutilating contractions of dependencynetworks is non-trivial, especially when non-well-founded networks are to be taken into account. I prove that the contraction problem is NP-complete.1
منابع مشابه
Fixed point theory for cyclic $varphi$-contractions in fuzzy metric spaces
In this paper, the notion of cyclic $varphi$-contraction in fuzzymetric spaces is introduced and a fixed point theorem for this typeof mapping is established. Meantime, an example is provided toillustrate this theorem. The main result shows that a self-mappingon a G-complete fuzzy metric space has a unique fixed point if itsatisfies the cyclic $varphi$-contraction. Afterwards, some results inco...
متن کاملContraction Degeneracy on Cographs
The contraction degeneracy of a graph G is the maximum minimum degree of G′ over all minors G′ of G. The corresponding decision problem is known to be NP -complete. In this paper, we present a dynamic programming approach for computing the contraction degeneracy of cographs.
متن کاملOn $F$-Weak Contraction of Generalized Multivalued Integral Type Mappings with $alpha $-admissible
The purpose of this work is to investigate the existence of fixed points of some mappings in fixed point theory by combining some important concepts which are F-weak contractions, multivalued mappings, integral transformations and α-admissible mappings. In fixed point theory, it is important to find fixed points of some classess under F- or F-weak contractions. Also multivalued mappings is the ...
متن کاملContraction checking in graphs on surfaces
The Contraction Checking problem asks, given two graphs H and G as input, whether H can be obtained from G by a sequence of edge contractions. Contraction Checking remains NP-complete, even when H is fixed. We show that this is not the case when G is embeddable in a surface of fixed Euler genus. In particular, we give an algorithm that solves Contraction Checking in f(h, g) · |V (G)|3 steps, wh...
متن کاملContraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all subgraphs of the minimum degree. The degeneracy is polynomial time computable. We introduce the notion of contraction degeneracy: the maximum over all minors of the minimum degree. We show that the contraction degenera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Logic Journal of the IGPL
دوره 11 شماره
صفحات -
تاریخ انتشار 2003